Information Bottleneck for a Rayleigh Fading MIMO Channel with an Oblivious Relay

This paper considers the information bottleneck (IB) problem of a Rayleigh fading multiple-input multiple-out (MIMO) channel with an oblivious relay. The relay is constrained to operating without knowledge codebooks, i.e., it performs processing. Moreover, due constraint, impossible for inform destination node perfect state (CSI) in each realization. To evaluate rate, we first provide upper bound by assuming that can obtain CSI at no cost. Then, four achievable schemes, where scheme satisfies constraint and gives lower rate. In second splits capacity relay–destination link into two parts conveys both its observation node. Due transmission, performance these schemes sensitive MIMO dimension, especially input dimension. ensure still well when dimension grows large, third fourth only transmits compressed observations Numerical results show that, simple symbol-by-symbol processing compression, proposed work demonstrate bounds come quite close on wide range relevant system parameters.